Temporal Stream Logic modulo Theories

Abstract Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems which is not expressive enough. In the semantics of TSL, functions are left uninterpreted. this paper, we extend TSL first-order theories, enabling us to specify using interpreted such as incrementation or equality. We investigate satisfiability problem modulo standard underlying theory uninterpreted well respect Presburger arithmetic equality: For all three neither semi-decidable nor co-semi-decidable. Nevertheless, identify fragments (semi-)decidable in functions. Despite undecidability, present an algorithm – guaranteed terminate checking a formula evaluate it: It scales able validate assumptions real-world system design.